MOMIS Goes Multimedia: WINDSURF and the Case of Top-K Queries
نویسندگان
چکیده
In a scenario with “traditional” and “multimedia” data sources, this position paper discusses the following question: “How can a multimedia local source (e.g., Windsurf) supporting ranking queries be integrated into a mediator system without such capabilities (e.g., MOMIS)?” More precisely, “How to support ranking queries coming from a multimedia local source within a mediator system with a “traditional” query processor based on an SQL-engine?” We first describe a naı̈ve approach for the execution of range and Top-K global queries where the MOMIS query processing method remains substantially unchanged, but, in the case of Top-K queries, it does not guarantee to obtain K results. We then discuss two alternative modalities for allowing MOMIS to return the Top-K best results of a global query.
منابع مشابه
Efficiently Managing Multimedia Hierarchical Data with the WINDSURF Library
Complex multimedia data are at the heart of several modern applications, such as image/video retrieval and the comparison of collection of documents. Frequently, such complex data are modeled as hierarchical objects that consist of different components, like videos including shots, images including visually coherent regions, and so on. When such complex objects are to be compared, for example, ...
متن کاملRankSQL: Supporting Ranking Queries in Relational Database Management Systems
Ranking queries (or top-k queries) are dominant in many emerging applications, e.g., similarity queries in multimedia databases, searching Web databases, middleware, and data mining. The increasing importance of top-k queries warrants an efficient support of ranking in the relational database management system (RDBMS) and has recently gained the attention of the research community. Top-k querie...
متن کاملQuery Optimization on Relational Databases for Supporting Top-k Query Processing Techniques
Information systems apply various techniques to rank query answers. Ranking queries (or top-k queries) are dominant in many emerging applications, e.g., similarity queries in multimedia databases, searching web databases, midlewares and data mining. In such application domains, end-users are more interested in the most important (top-k) query answers in the potentially huge answer space. Thus f...
متن کاملEfficient Processing of Distributed Top-k Queries
Ranking-aware queries, or top-k queries, have received much attention recently in various contexts such as web, multimedia retrieval, relational databases, and distributed systems. Top-k queries play a critical role in many decision-making related activities such as, identifying interesting objects, network monitoring, load balancing, etc. In this paper, we study the ranking aggregation problem...
متن کاملRefining Top-k Selection Queries based on User Feedback
In many applications, users specify target values for certain attributes/features, without requiring exact matches to these values in return. Instead, the result is typically a ranked list of “top k” objects that best match the specified feature values. User subjectivity is an important aspect of such queries i.e. which objects are relevant to the user and which are not depends on the perceptio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015